Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time

Plurality consensus considers a network of n nodes, each having one of k opinions. Nodes execute a (randomized) distributed protocol with the goal that all nodes adopt the plurality (the opinion initially supported by the most nodes). Communication is realized via the Gossip (or random phone call) model. A major open question has been whether there is a protocol for the complete graph that converges (w.h.p.) in polylogarithmic time and uses only polylogarithmic memory per node (local memory). We answer this question affirmatively. We propose two protocols that need only mild assumptions on the bias in favor of the plurality. As an example of our results, consider the complete graph and an arbitrarily small constant multiplicative bias in favor of the plurality. Our first protocol achieves plurality consensus in O (log k · log logn) rounds using log k + Θ (log log k) bits of local memory. Our second protocol achieves plurality consensus in O (logn · log logn) rounds using only log k+4 bits of local memory. This disproves a conjecture by Becchetti et al. (SODA’15) implying that any protocol with local memory log k+ O (1) has worst-case runtime Ω (k). We provide similar bounds for much weaker bias assumptions. At the heart of our protocols lies an undecided state, an idea introduced by Angluin et al. (Distributed Computing’08). 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems